Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling
نویسندگان
چکیده
Grid computing which is based on the high performance computing environment, basically used for solving complex computational demands. In the grid computing environment, scheduling of tasks is a big challenge. The task scheduling problem can be defined as a problem of assigning the number of resources to tasks where number of resources is less than the number of available tasks. Particle swarm optimization (PSO) algorithm is one of the heuristic search based optimization technique. It is an effective optimization technique for different continuous optimization problems. In this work, modified version of PSO algorithm with smallest position value (SPV) is used and implemented on grid task scheduling problem. Here in the modified PSO algorithm, one additional phase in the form of mutation operator is used and smallest position value is used for enhancing local search. Proposed work is compared with the genetic algorithm and PSO algorithm. Experimental results show that the proposed work is better than previous algorithms.
منابع مشابه
Grid Scheduling Using PSO with SPV Rule
Grid computing can be defined as applying the resources of many computers in a network to a problem which requires a great number of computer processing cycles or access to large amounts of data. However, in the field of grid computing scheduling of tasks is a big challenge. The task scheduling problem is the problem of assigning the tasks in the system in a manner that will optimize the overal...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملP. MATHIYALAGAN et al.: ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clus...
متن کاملEnhanced Hybrid Pso – Aco Algorithm for Grid Scheduling
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015